Matrix insertion–deletion systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SOLVING FUZZY LINEAR SYSTEMS BY USING THE SCHUR COMPLEMENT WHEN COEFFICIENT MATRIX IS AN M-MATRIX

This paper analyzes a linear system of equations when the righthandside is a fuzzy vector and the coefficient matrix is a crisp M-matrix. Thefuzzy linear system (FLS) is converted to the equivalent crisp system withcoefficient matrix of dimension 2n × 2n. However, solving this crisp system isdifficult for large n because of dimensionality problems . It is shown that thisdifficulty may be avoide...

متن کامل

On the modified iterative methods for $M$-matrix linear systems

This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...

متن کامل

Matrix insertion-deletion systems

In this article, we consider for the first time the operations of insertion and deletion working in a matrix controlled manner. We show that, similarly as in the case of context-free productions, the computational power is strictly increased when using a matrix control: computational completeness can be obtained by systems with insertion or deletion rules involving at most two symbols in a cont...

متن کامل

solving fuzzy linear systems by using the schur complement when coefficient matrix is an m-matrix

this paper analyzes a linear system of equations when the righthandside is a fuzzy vector and the coefficient matrix is a crisp m-matrix. thefuzzy linear system (fls) is converted to the equivalent crisp system withcoefficient matrix of dimension 2n × 2n. however, solving this crisp system isdifficult for large n because of dimensionality problems . it is shown that thisdifficulty may be avoide...

متن کامل

on the modified iterative methods for $m$-matrix linear systems

this paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the accelerated overrelaxation (aor) method. in this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2012

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2012.07.002